0 M ay 2 00 4 A Note on Ramsey Numbers for Books
نویسنده
چکیده
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn) = 2n + 3 for all n ≥ cm.
منابع مشابه
M ay 2 00 8 On the Ramsey numbers for paths and generalized Jahangir graphs
For given graphs G and H, the Ramsey number R(G,H) is the least natural number n such that for every graph F of order n the following condition holds: either F contains G or the complement of F contains H. In this paper, we determine the Ramsey number of paths versus generalized Jahangir graphs. We also derive the Ramsey number R(tPn,H), where H is a generalized Jahangir graph Js,m where s ≥ 2 ...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کامل2 9 M ay 2 00 4 A refined version of the Siegel - Shidlovskii theorem
Using Y.André's result on differential equations staisfied by E-functions, we derive an improved version of the Siegel-Shidlovskii theorem. It gives a complete characterisation of algebraic relations over the algebraic numbers between values of E-functions at any non-zero algebraic point.
متن کاملar X iv : m at h / 04 11 14 0 v 2 [ m at h . N T ] 4 M ay 2 00 5 THE 3 x + 1 SEMIGROUP
The 3x + 1 semigroup is the multiplicative semigroup S of positive rational numbers generated by { 2k+1 3k+2 : k ≥ 0} together with {2}. This semigroup encodes backwards iteration under the 3x + 1 map, and the 3x + 1 conjecture implies that it contains every positive integer. This semigroup is proved to be the set of positive rationals a b in lowest terms with b 6≡ 0( mod 3), and so contains al...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کامل